Maximising the number of connected induced subgraphs of unicyclic graphs
نویسندگان
چکیده
Denote by $\mathcal{G}(n,c,g,k)$ the set of all connected graphs order $n$, having $c$ cycles, girth $g$, and $k$ pendant vertices. In this paper, we give a partial characterisation structure those in maximising number induced subgraphs. For special case where $c=1$, find complete maximal unicyclic graphs. We also derive precise formula for corresponding maximum given following parameters: (1) order, girth, vertices; (2) girth; (3) order.
منابع مشابه
Graphs with Most Number of Three Point Induced Connected Subgraphs
Let G be a simple graph with e perfectly reliable edges and n nodes which fail independently and with the same probability ρ. The residual connectedness reliability R(G, ) ρ of G is the probability that the graph induced by the surviving nodes is connected. If Γ(n, e) is the collection of all n node e edge simple graphs, then G n e ∈Γ( , ) is uniformly most reliable if R G R G ( , ) ( , ) ρ ρ ≥...
متن کاملMaximising the number of independent sets in connected graphs
A Turán connected graph TCn,α is obtained from α cliques of size b αc or d αe by joining all cliques by an edge to one central vertex in one of the larger cliques. The graph TCn,α was shown recently by Bruyère and Mélot to maximise the number of independent sets among connected graphs of order n and independence number α. We prove a generalisation of this result by showing that TCn,α in fact ma...
متن کاملHighly connected subgraphs of graphs with given independence number
Let G be a graph on n vertices with independence number α. What is the largest k-connected subgraph that G must contain? We prove that if n is sufficiently large (n ≥ αk + 1 will do), then G always contains a k-connected subgraph on at least n/α vertices. This is sharp, since G might be the disjoint union of α equally-sized cliques. For k ≥ 3 and α = 2, 3, we shall prove that the same result ho...
متن کامل$K_{4}$-Minor-Free Induced Subgraphs of Sparse Connected Graphs
We prove that every connected graph G with m edges contains a set X of at most 3 16 (m+ 1) vertices such that G−X has no K4 minor, or equivalently, has treewidth at most 2. This bound is best possible and improves a recent bound of 19 100m+ 3 20 due to Edwards and Farr. Connectivity is essential: If G is not connected then only a bound of 15m can be guaranteed.
متن کاملConnected Resolving Partitions in Unicyclic Graphs
A k-partition Π = {S1,S2, . . . ,Sk} of V (G) is resolving if for every two distinct vertices u and v of a connected graph G, there is a set Si in Π so that the minimum distance between u and a vertex of Si is different from the minimum distance between v and a vertex of Si. A resolving partition Π is said to be connected if each subgraph < Si > induced by Si (1 ≤ i ≤ k) is connected in G. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Turkish Journal of Mathematics
سال: 2022
ISSN: ['1303-6149', '1300-0098']
DOI: https://doi.org/10.55730/1300-0098.3337